#include<bits/stdc++.h>
using namespace std;
const int N =1e5 + 10;
int n,liebiao[N];
int main()
{
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    scanf("%d",&n);
    for(int i=1;i<=n;i++)scanf("%d",&liebiao[i]);
    sort(liebiao+1,liebiao+n+1);
    if(n>=2)
    {
        int l=1,r=2;
        while(r<=n)
        {
            if(liebiao[r]>liebiao[l])l++,r++;
            else r++;
        }
        printf("%d",r-l);
        return 0;
    }
    else
    {
        if(liebiao[2]>liebiao[1])
        {
            printf("%d",1);
        }else  printf("%d",2);
    }
}
